Construction of Lightweight MDS Matrices over Matrix Polynomial Residue Ring

نویسندگان

  • Lijing Zhou
  • Licheng Wang
  • Yiru Sun
چکیده

In this article, we investigate the construction of lightweight MDS matrices over the matrix polynomial residue ring. According to distributions of the minimum polynomial, distributions of XOR count and equivalence classes of MDS matrices, we propose an algorithm, which not only can construct lightest MDS matrices, but also is evidently more efficient than previous methods. Moreover, we investigate existences of involutory MDS matrices over the matrix polynomial residue ring. According to quadratic congruence, over the matrix polynomial residue ring, we propose a simplified necessary-and-sufficient condition for deciding whether a Hadamard matrix is invorlutory. With this method, we propose another efficient and special algorithm to construct lightweight Hadamard involutory MDS matrices. Over the 8× 8 matrix polynomial residue ring, we construct vast 4×4 Hadamard involutory MDS matrices with 20 XORs, which are much lighter than previous results. In addition, we obtain a series of propositions about the parity of XOR count.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Construction of Lightweight Orthogonal MDS Matrices

In present paper, we investigate 4 problems. Firstly, it is known that, a matrix is MDS if and only if all sub-matrices of this matrix of degree from 1 to n are full rank. In this paper, we propose a theorem that an orthogonal matrix is MDS if and only if all sub-matrices of this orthogonal matrix of degree from 1 to bn2 c are full rank. With this theorem, calculation of constructing orthogonal...

متن کامل

Construction and Filtration of Lightweight Formalized MDS Matrices

Zhang Shi-Yi, Wang Yong-juan, Gao Yang, Wang Tao Corresponding author: Wang Yong-juan, E-mail: [email protected] Abstract: The 4 4  MDS matrix over 2 F is widely used in the design of block cipher's linear diffusion layers. However, considering the cost of a lightweight cipher's implementation, the sum of XOR operations of a MDS matrix usually plays the role of measure. During the research on t...

متن کامل

Lightweight 4x4 MDS Matrices for Hardware-Oriented Cryptographic Primitives

Linear diffusion layer is an important part of lightweight block ciphers and hash functions. This paper presents an efficient class of lightweight 4x4 MDS matrices such that the implementation cost of them and their corresponding inverses are equal. The main target of the paper is hardware oriented cryptographic primitives and the implementation cost is measured in terms of the required number ...

متن کامل

On Constructions of MDS Matrices from Companion Matrices for Lightweight Cryptography

Maximum distance separable (MDS) matrices have applications not only in coding theory but also are of great importance in the design of block ciphers and hash functions. It is highly nontrivial to find MDS matrices which could be used in lightweight cryptography. In a crypto 2011 paper, Guo et. al. proposed a new MDS matrix Serial(1, 2, 1, 4) over F28 . This representation has a compact hardwar...

متن کامل

Lightweight MDS Involution Matrices

In this article, we provide new methods to look for lightweight MDS matrices, and in particular involutory ones. By proving many new properties and equivalence classes for various MDS matrices constructions such as circulant, Hadamard, Cauchy and Hadamard-Cauchy, we exhibit new search algorithms that greatly reduce the search space and make lightweight MDS matrices of rather high dimension poss...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2016  شماره 

صفحات  -

تاریخ انتشار 2016